Labahn and Monagan Mitacs Short Project Cv and Business Plan Mathematics of Computer Algebra and Analysis (mocaa)

Labahn and Monagan Mitacs Project Cv and Business Plan Mathematics of Computer Algebra and Analysis (mocaa)

Polynomial multiplication and division using heap

We report on new code for sparse multivariate polynomial multiplication and division that we have recently integrated into Maple as part of our MITACS project at Simon Fraser University. Our goal was to try to beat Magma which is widely viewed in the computer algebra community as having state-of-the-art polynomial algebra. Here we give benchmarks comparing our implementation for multiplication ...

On the numerical condition of a generalized Hankel eigenvalue problem

The generalized eigenvalue problem ̃ Hy= λHy with H a Hankel matrix and ̃ H the corresponding shifted Hankel matrix occurs in number of applications such as the reconstruction of the shape of a polygon from its moments, the determination of abscissa of quadrature formulas, of poles of Padé approximants, or of the unknown powers of a sparse black box polynomial in computer algebra. In many of th...

Primitive Ideal Space of Ultragraph $C^*$-algebras

In this paper, we describe the primitive ideal space of the $C^*$-algebra $C^*(mathcal G)$  associated to the ultragraph $mathcal{G}$. We investigate the structure of the closed ideals of the quotient ultragraph $  C^* $-algebra  $C^*left(mathcal G/(H,S)right)$ which contain no nonzero set projections and then we characterize all non gauge-invariant primitive ideals. Our results generalize the ...

On bounded weak approximate identities and a new version of them

In this paper, we give a short survey of results and problems concerning the notion of bounded weak approximate identities in Banach algebras. Also, we introduce a new version of approximate identities and give one illuminating example to show the difference.